Communication Centrality in Dynamic Networks Using Time-Ordered Weighted Graph
نویسندگان
چکیده
Centrality is an important concept in the study of social network analysis (SNA), which is used to measure the importance of a node in a network. While many different centrality measures exist, most of them are proposed and applied to static networks. However, most types of networks are dynamic that their topology changes over time. A popular approach to represent such networks is to construct a sequence of time windows with a single aggregated static graph that aggregates all edges observed over some time period. In this paper, an approach which overcomes the limitation of this representation is proposed based on the notion of the time-ordered graph, to measure the communication centrality of a node in dynamic networks.
منابع مشابه
A Test of Time: Time-Aggregated Networks and Time-Ordered Networks in Behavioural Ecology
Network theory has become a popular modelling framework within behavioural ecology. In order to use the wide range of existing tools, network practitioners typically collapse dynamic data into a static network for subsequent analysis. Temporal networks provide a relatively new framework for modelling dynamic network data, and retain either some or all of the temporal dynamics that are lost with...
متن کاملFully Dynamic Betweenness Centrality Maintenance on Massive Networks
Measuring the relative importance of each vertex in a network is one of the most fundamental building blocks in network analysis. Among several importance measures, betweenness centrality, in particular, plays key roles in many real applications. Considerable effort has been made for developing algorithms for static settings. However, real networks today are highly dynamic and are evolving rapi...
متن کاملTemporal node centrality in complex networks.
Many networks are dynamic in that their topology changes rapidly--on the same time scale as the communications of interest between network nodes. Examples are the human contact networks involved in the transmission of disease, ad hoc radio networks between moving vehicles, and the transactions between principals in a market. While we have good models of static networks, so far these have been l...
متن کاملADAPTIVE ORDERED WEIGHTED AVERAGING FOR ANOMALY DETECTION IN CLUSTER-BASED MOBILE AD HOC NETWORKS
In this paper, an anomaly detection method in cluster-based mobile ad hoc networks with ad hoc on demand distance vector (AODV) routing protocol is proposed. In the method, the required features for describing the normal behavior of AODV are defined via step by step analysis of AODV and independent of any attack. In order to learn the normal behavior of AODV, a fuzzy averaging method is used fo...
متن کاملFully-Dynamic Approximation of Betweenness Centrality
Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths. Since an exact computation is prohibitive in large networks, several approximation algorithms have been proposed. Besides that, recent years have seen the publication of dynamic algorithms for efficient recomputation of betweenness in evolving networks. In previou...
متن کامل